EXTENDED RUNS 1 The Extended Runs Procedure and Restart Cost Erik
نویسنده
چکیده
Task-switching procedures provides a means to study the interplay between goal-directedness and cognitive flexibility at a fine temporal grain. Most such procedures cue the current task perceptually on all trials, which means that processes related to this cue factor into behavioral measures on all trials. The extended-runs procedure discussed here makes it possible to isolate stimulus-related processes and the role of episodic memory for the current task. In this procedure, participants perform runs of trials governed by the same task, with the (randomly selected) task cue presented only at the start of the run and then withdrawn. This chapter briefly reviews empirical studies involving this procedure, and theoretical work suggesting that memory-based cognitive control is in fact the general case and thus that results from the extended-runs procedure can be taken to generalize to explicit cuing and alternating runs.
منابع مشابه
Identification of an Autonomous Underwater Vehicle Dynamic Using Extended Kalman Filter with ARMA Noise Model
In the procedure of designing an underwater vehicle or robot, its maneuverability and controllability must be simulated and tested, before the product is finalized for manufacturing. Since the hydrodynamic forces and moments highly affect the dynamic and maneuverability of the system, they must be estimated with a reasonable accuracy. In this study, hydrodynamic coefficients of an autonomous un...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملRestart Policies with Dependence among Runs: A Dynamic Programming Approach
The time required for a backtracking search procedure to solve a problem can be reduced by employing randomized restart procedures. To date, researchers designing restart policies have relied on the simplifying assumption that runs are probabilistically independent from one another. We relax the assumption of independence among runs and address the challenge of identifying an optimal restart po...
متن کاملGeneralized Resolution and Minimum Aberration for Nonregular Fractional Factorial Designs
Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...
متن کاملComparing switch costs: alternating runs and explicit cuing.
The task-switching literature routinely conflates different operational definitions of switch cost, its predominant behavioral measure. This article is an attempt to draw attention to differences between the two most common definitions, alternating-runs switch cost (ARS) and explicit-cuing switch cost (ECS). ARS appears to include both the costs of switching tasks and the switch-independent cos...
متن کامل